#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int test;
cin >> test;
while (test--) {
int n, w, h;
cin >> n >> w >> h;
int a[n + 5];
int b[n + 5];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
cin >> b[i];
}
int l[n + 5];
int r[n + 5];
for (int i = 1; i <= n; i++) {
l[i] = b[i] + h - (a[i] + w);
r[i] = b[i] - h - (a[i] - w);
}
sort(l + 1, l + n + 1);
sort(r + 1, r + n + 1);
if (l[n] <= r[1])
cout << "YES" << endl;
else
cout << "NO" << endl;
}
}
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |
1521A - Nastia and Nearly Good Numbers | 208. Implement Trie |
1605B - Reverse Sort | 1607C - Minimum Extraction |
1604B - XOR Specia-LIS-t | 1606B - Update Files |
1598B - Groups | 1602B - Divine Array |